TSTP Solution File: SET576^7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET576^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:09 EDT 2024
% Result : Theorem 0.23s 0.44s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET576^7 : TPTP v8.2.0. Released v5.5.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.37 % Computer : n027.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon May 20 12:28:38 EDT 2024
% 0.23/0.38 % CPUTime :
% 0.23/0.38 This is a TH0_THM_EQU_NAR problem
% 0.23/0.38 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.40 % (3683)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.23/0.40 % (3680)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.23/0.40 % (3685)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.23/0.40 % (3682)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.23/0.40 % (3684)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.23/0.40 % (3681)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.23/0.40 % (3686)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.40 % (3687)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.40 % (3683)Instruction limit reached!
% 0.23/0.40 % (3683)------------------------------
% 0.23/0.40 % (3683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (3683)Termination reason: Unknown
% 0.23/0.40 % (3683)Termination phase: shuffling
% 0.23/0.40
% 0.23/0.40 % (3684)Instruction limit reached!
% 0.23/0.40 % (3684)------------------------------
% 0.23/0.40 % (3684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (3683)Memory used [KB]: 1023
% 0.23/0.40 % (3683)Time elapsed: 0.002 s
% 0.23/0.40 % (3683)Instructions burned: 2 (million)
% 0.23/0.40 % (3683)------------------------------
% 0.23/0.40 % (3683)------------------------------
% 0.23/0.40 % (3684)Termination reason: Unknown
% 0.23/0.40 % (3684)Termination phase: shuffling
% 0.23/0.40
% 0.23/0.40 % (3684)Memory used [KB]: 1023
% 0.23/0.40 % (3684)Time elapsed: 0.003 s
% 0.23/0.40 % (3684)Instructions burned: 2 (million)
% 0.23/0.40 % (3684)------------------------------
% 0.23/0.40 % (3684)------------------------------
% 0.23/0.40 % (3687)Instruction limit reached!
% 0.23/0.40 % (3687)------------------------------
% 0.23/0.40 % (3687)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (3687)Termination reason: Unknown
% 0.23/0.40 % (3687)Termination phase: shuffling
% 0.23/0.40
% 0.23/0.40 % (3687)Memory used [KB]: 1023
% 0.23/0.40 % (3687)Time elapsed: 0.004 s
% 0.23/0.40 % (3687)Instructions burned: 4 (million)
% 0.23/0.40 % (3687)------------------------------
% 0.23/0.40 % (3687)------------------------------
% 0.23/0.40 % (3681)Instruction limit reached!
% 0.23/0.40 % (3681)------------------------------
% 0.23/0.40 % (3681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (3681)Termination reason: Unknown
% 0.23/0.40 % (3681)Termination phase: Property scanning
% 0.23/0.40
% 0.23/0.40 % (3681)Memory used [KB]: 1023
% 0.23/0.40 % (3681)Time elapsed: 0.004 s
% 0.23/0.40 % (3681)Instructions burned: 5 (million)
% 0.23/0.40 % (3681)------------------------------
% 0.23/0.40 % (3681)------------------------------
% 0.23/0.41 % (3685)Refutation not found, incomplete strategy
% 0.23/0.41 % (3685)------------------------------
% 0.23/0.41 % (3685)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (3685)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.41
% 0.23/0.41
% 0.23/0.41 % (3685)Memory used [KB]: 5628
% 0.23/0.41 % (3685)Time elapsed: 0.009 s
% 0.23/0.41 % (3685)Instructions burned: 13 (million)
% 0.23/0.41 % (3685)------------------------------
% 0.23/0.41 % (3685)------------------------------
% 0.23/0.41 % (3686)Instruction limit reached!
% 0.23/0.41 % (3686)------------------------------
% 0.23/0.41 % (3686)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (3686)Termination reason: Unknown
% 0.23/0.41 % (3686)Termination phase: Saturation
% 0.23/0.41
% 0.23/0.41 % (3686)Memory used [KB]: 5628
% 0.23/0.41 % (3686)Time elapsed: 0.011 s
% 0.23/0.41 % (3686)Instructions burned: 19 (million)
% 0.23/0.41 % (3686)------------------------------
% 0.23/0.41 % (3686)------------------------------
% 0.23/0.41 % (3682)Instruction limit reached!
% 0.23/0.41 % (3682)------------------------------
% 0.23/0.41 % (3682)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (3682)Termination reason: Unknown
% 0.23/0.41 % (3682)Termination phase: Saturation
% 0.23/0.41
% 0.23/0.41 % (3682)Memory used [KB]: 5756
% 0.23/0.41 % (3682)Time elapsed: 0.015 s
% 0.23/0.41 % (3682)Instructions burned: 28 (million)
% 0.23/0.41 % (3682)------------------------------
% 0.23/0.41 % (3682)------------------------------
% 0.23/0.41 % (3688)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.23/0.41 % (3689)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.23/0.42 % (3690)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.42 % (3691)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.23/0.42 % (3690)Instruction limit reached!
% 0.23/0.42 % (3690)------------------------------
% 0.23/0.42 % (3690)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (3690)Termination reason: Unknown
% 0.23/0.42 % (3690)Termination phase: shuffling
% 0.23/0.42
% 0.23/0.42 % (3690)Memory used [KB]: 1023
% 0.23/0.42 % (3690)Time elapsed: 0.003 s
% 0.23/0.42 % (3690)Instructions burned: 3 (million)
% 0.23/0.42 % (3690)------------------------------
% 0.23/0.42 % (3690)------------------------------
% 0.23/0.42 % (3692)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.42 % (3689)Instruction limit reached!
% 0.23/0.42 % (3689)------------------------------
% 0.23/0.42 % (3689)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (3689)Termination reason: Unknown
% 0.23/0.42 % (3689)Termination phase: Saturation
% 0.23/0.42
% 0.23/0.42 % (3689)Memory used [KB]: 1151
% 0.23/0.42 % (3689)Time elapsed: 0.009 s
% 0.23/0.42 % (3689)Instructions burned: 15 (million)
% 0.23/0.42 % (3689)------------------------------
% 0.23/0.42 % (3689)------------------------------
% 0.23/0.42 % (3693)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.23/0.42 % (3692)Instruction limit reached!
% 0.23/0.42 % (3692)------------------------------
% 0.23/0.42 % (3692)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42 % (3692)Termination reason: Unknown
% 0.23/0.42 % (3692)Termination phase: SInE selection
% 0.23/0.42
% 0.23/0.42 % (3692)Memory used [KB]: 1023
% 0.23/0.42 % (3692)Time elapsed: 0.005 s
% 0.23/0.42 % (3692)Instructions burned: 7 (million)
% 0.23/0.42 % (3692)------------------------------
% 0.23/0.42 % (3692)------------------------------
% 0.23/0.43 % (3694)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.43 % (3694)Instruction limit reached!
% 0.23/0.43 % (3694)------------------------------
% 0.23/0.43 % (3694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (3694)Termination reason: Unknown
% 0.23/0.43 % (3694)Termination phase: shuffling
% 0.23/0.43
% 0.23/0.43 % (3694)Memory used [KB]: 1023
% 0.23/0.43 % (3694)Time elapsed: 0.004 s
% 0.23/0.43 % (3694)Instructions burned: 4 (million)
% 0.23/0.43 % (3694)------------------------------
% 0.23/0.43 % (3694)------------------------------
% 0.23/0.43 % (3693)Instruction limit reached!
% 0.23/0.43 % (3693)------------------------------
% 0.23/0.43 % (3693)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (3693)Termination reason: Unknown
% 0.23/0.43 % (3693)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (3693)Memory used [KB]: 5628
% 0.23/0.43 % (3693)Time elapsed: 0.010 s
% 0.23/0.43 % (3693)Instructions burned: 17 (million)
% 0.23/0.43 % (3693)------------------------------
% 0.23/0.43 % (3693)------------------------------
% 0.23/0.43 % (3695)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.43 % (3680)First to succeed.
% 0.23/0.43 % (3695)Instruction limit reached!
% 0.23/0.43 % (3695)------------------------------
% 0.23/0.43 % (3695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (3695)Termination reason: Unknown
% 0.23/0.43 % (3695)Termination phase: shuffling
% 0.23/0.43
% 0.23/0.43 % (3695)Memory used [KB]: 1023
% 0.23/0.43 % (3695)Time elapsed: 0.003 s
% 0.23/0.43 % (3695)Instructions burned: 3 (million)
% 0.23/0.43 % (3695)------------------------------
% 0.23/0.43 % (3695)------------------------------
% 0.23/0.43 % (3688)Instruction limit reached!
% 0.23/0.43 % (3688)------------------------------
% 0.23/0.43 % (3688)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (3688)Termination reason: Unknown
% 0.23/0.43 % (3688)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (3688)Memory used [KB]: 5884
% 0.23/0.43 % (3688)Time elapsed: 0.020 s
% 0.23/0.43 % (3688)Instructions burned: 37 (million)
% 0.23/0.43 % (3688)------------------------------
% 0.23/0.43 % (3688)------------------------------
% 0.23/0.44 % (3696)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.44 % (3697)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.44 % (3696)Instruction limit reached!
% 0.23/0.44 % (3696)------------------------------
% 0.23/0.44 % (3696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (3696)Termination reason: Unknown
% 0.23/0.44 % (3696)Termination phase: Property scanning
% 0.23/0.44
% 0.23/0.44 % (3696)Memory used [KB]: 1023
% 0.23/0.44 % (3696)Time elapsed: 0.005 s
% 0.23/0.44 % (3696)Instructions burned: 7 (million)
% 0.23/0.44 % (3696)------------------------------
% 0.23/0.44 % (3696)------------------------------
% 0.23/0.44 % (3680)Refutation found. Thanks to Tanya!
% 0.23/0.44 % SZS status Theorem for theBenchmark
% 0.23/0.44 % SZS output start Proof for theBenchmark
% 0.23/0.44 thf(type_def_5, type, mu: $tType).
% 0.23/0.44 thf(func_def_0, type, mu: $tType).
% 0.23/0.44 thf(func_def_1, type, qmltpeq: mu > mu > $i > $o).
% 0.23/0.44 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_6, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_7, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_8, type, mtrue: $i > $o).
% 0.23/0.44 thf(func_def_9, type, mfalse: $i > $o).
% 0.23/0.44 thf(func_def_10, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_11, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_12, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_13, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_14, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_15, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_16, type, exists_in_world: mu > $i > $o).
% 0.23/0.44 thf(func_def_17, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_18, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_19, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_20, type, mreflexive: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_21, type, msymmetric: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_22, type, mserial: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_23, type, mtransitive: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_24, type, meuclidean: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_25, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_26, type, mfunctional: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_27, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_28, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_29, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.23/0.44 thf(func_def_30, type, mvalid: ($i > $o) > $o).
% 0.23/0.44 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.23/0.44 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.23/0.44 thf(func_def_33, type, minvalid: ($i > $o) > $o).
% 0.23/0.44 thf(func_def_34, type, rel_s4: $i > $i > $o).
% 0.23/0.44 thf(func_def_35, type, mbox_s4: ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_36, type, mdia_s4: ($i > $o) > $i > $o).
% 0.23/0.44 thf(func_def_37, type, intersect: mu > mu > $i > $o).
% 0.23/0.44 thf(func_def_38, type, disjoint: mu > mu > $i > $o).
% 0.23/0.44 thf(func_def_39, type, member: mu > mu > $i > $o).
% 0.23/0.44 thf(func_def_55, type, sK0: $i > mu).
% 0.23/0.44 thf(func_def_58, type, sK2: mu > $i > mu > mu).
% 0.23/0.44 thf(func_def_60, type, sK4: mu).
% 0.23/0.44 thf(func_def_61, type, sK5: mu).
% 0.23/0.44 thf(f504,plain,(
% 0.23/0.44 $false),
% 0.23/0.44 inference(avatar_sat_refutation,[],[f298,f308,f433,f477,f491,f501])).
% 0.23/0.44 thf(f501,plain,(
% 0.23/0.44 ~spl1_3 | ~spl1_6),
% 0.23/0.44 inference(avatar_contradiction_clause,[],[f500])).
% 0.23/0.44 thf(f500,plain,(
% 0.23/0.44 $false | (~spl1_3 | ~spl1_6)),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f492])).
% 0.23/0.44 thf(f492,plain,(
% 0.23/0.44 ($false = $true) | (~spl1_3 | ~spl1_6)),
% 0.23/0.44 inference(superposition,[],[f469,f296])).
% 0.23/0.44 thf(f296,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $true) | ~spl1_3),
% 0.23/0.44 inference(avatar_component_clause,[],[f294])).
% 0.23/0.44 thf(f294,plain,(
% 0.23/0.44 spl1_3 <=> ((intersect @ sK4 @ sK5 @ sK3) = $true)),
% 0.23/0.44 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.23/0.44 thf(f469,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | ~spl1_6),
% 0.23/0.44 inference(avatar_component_clause,[],[f467])).
% 0.23/0.44 thf(f467,plain,(
% 0.23/0.44 spl1_6 <=> ((intersect @ sK4 @ sK5 @ sK3) = $false)),
% 0.23/0.44 introduced(avatar_definition,[new_symbols(naming,[spl1_6])])).
% 0.23/0.44 thf(f491,plain,(
% 0.23/0.44 spl1_6 | spl1_1 | spl1_2 | ~spl1_7),
% 0.23/0.44 inference(avatar_split_clause,[],[f490,f471,f290,f286,f467])).
% 0.23/0.44 thf(f286,plain,(
% 0.23/0.44 spl1_1 <=> ((exists_in_world @ sK4 @ sK3) = $false)),
% 0.23/0.44 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.23/0.44 thf(f290,plain,(
% 0.23/0.44 spl1_2 <=> ((exists_in_world @ sK5 @ sK3) = $false)),
% 0.23/0.44 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.23/0.44 thf(f471,plain,(
% 0.23/0.44 spl1_7 <=> ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false)),
% 0.23/0.44 introduced(avatar_definition,[new_symbols(naming,[spl1_7])])).
% 0.23/0.44 thf(f490,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | (spl1_1 | spl1_2 | ~spl1_7)),
% 0.23/0.44 inference(subsumption_resolution,[],[f489,f291])).
% 0.23/0.44 thf(f291,plain,(
% 0.23/0.44 ((exists_in_world @ sK5 @ sK3) != $false) | spl1_2),
% 0.23/0.44 inference(avatar_component_clause,[],[f290])).
% 0.23/0.44 thf(f489,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false) | (spl1_1 | ~spl1_7)),
% 0.23/0.44 inference(subsumption_resolution,[],[f483,f287])).
% 0.23/0.44 thf(f287,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) != $false) | spl1_1),
% 0.23/0.44 inference(avatar_component_clause,[],[f286])).
% 0.23/0.44 thf(f483,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false) | ((intersect @ sK4 @ sK5 @ sK3) = $false) | ~spl1_7),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f480])).
% 0.23/0.44 thf(f480,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) = $false) | ((intersect @ sK4 @ sK5 @ sK3) = $false) | ($false = $true) | ((exists_in_world @ sK5 @ sK3) = $false) | ~spl1_7),
% 0.23/0.44 inference(superposition,[],[f213,f473])).
% 0.23/0.44 thf(f473,plain,(
% 0.23/0.44 ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | ~spl1_7),
% 0.23/0.44 inference(avatar_component_clause,[],[f471])).
% 0.23/0.44 thf(f213,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ (sK2 @ X3 @ X1 @ X2) @ X1) = $true) | ((intersect @ X2 @ X3 @ X1) = $false) | ((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f211])).
% 0.23/0.44 thf(f211,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((exists_in_world @ X3 @ X1) = $false) | (((exists_in_world @ (sK2 @ X3 @ X1 @ X2) @ X1) => ((~ (member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1)) | (~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1)))) = $false) | ((intersect @ X2 @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f210])).
% 0.23/0.44 thf(f210,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))) @ (sK2 @ X3 @ X1 @ X2))) | ($false = (exists_in_world @ X2 @ X1)) | ((exists_in_world @ X3 @ X1) = $false) | ((intersect @ X2 @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(sigma_clausification,[],[f209])).
% 0.23/0.44 thf(f209,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1)) | ((intersect @ X2 @ X3 @ X1) = $false) | ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1)))))))) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f208])).
% 0.23/0.44 thf(f208,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((~ (intersect @ X2 @ X3 @ X1)) = $true) | ($false = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | ((exists_in_world @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f207])).
% 0.23/0.44 thf(f207,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ((exists_in_world @ X3 @ X1) = $false) | ((~ (intersect @ X2 @ X3 @ X1)) = $true)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f206])).
% 0.23/0.44 thf(f206,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((exists_in_world @ X3 @ X1) = $false) | (((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | (~ (intersect @ X2 @ X3 @ X1))) = $true)) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f196])).
% 0.23/0.44 thf(f196,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1)) | ((~ ((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | (~ (intersect @ X2 @ X3 @ X1)))) = $false)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f195])).
% 0.23/0.44 thf(f195,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = ((~ ((intersect @ X2 @ X3 @ X1) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | (~ (intersect @ X2 @ X3 @ X1)))))) | ((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f194])).
% 0.23/0.44 thf(f194,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ((~ ((~ ((intersect @ X2 @ X3 @ X1) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | (~ (intersect @ X2 @ X3 @ X1)))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f193])).
% 0.23/0.44 thf(f193,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((exists_in_world @ X3 @ X1) => (~ ((~ ((intersect @ X2 @ X3 @ X1) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => ((~ (member @ Y0 @ X3 @ X1)) | (~ (member @ Y0 @ X2 @ X1))))))) | (~ (intersect @ X2 @ X3 @ X1))))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f192])).
% 0.23/0.44 thf(f192,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((intersect @ X2 @ Y0 @ X1) | (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1))))))) | (~ (intersect @ X2 @ Y0 @ X1)))))))) @ X3) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(pi_clausification,[],[f191])).
% 0.23/0.44 thf(f191,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((intersect @ X2 @ Y0 @ X1) | (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1))))))) | (~ (intersect @ X2 @ Y0 @ X1))))))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f190])).
% 0.23/0.44 thf(f190,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : ((((exists_in_world @ X2 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((intersect @ X2 @ Y0 @ X1) | (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => ((~ (member @ Y1 @ Y0 @ X1)) | (~ (member @ Y1 @ X2 @ X1))))))) | (~ (intersect @ X2 @ Y0 @ X1)))))))))) = $true)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f189])).
% 0.23/0.44 thf(f189,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((intersect @ Y0 @ Y1 @ X1) | (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((~ (member @ Y2 @ Y1 @ X1)) | (~ (member @ Y2 @ Y0 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((~ (member @ Y2 @ Y1 @ X1)) | (~ (member @ Y2 @ Y0 @ X1))))))) | (~ (intersect @ Y0 @ Y1 @ X1))))))))))) @ X2) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f188])).
% 0.23/0.44 thf(f188,plain,(
% 0.23/0.44 ( ! [X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((intersect @ Y0 @ Y1 @ X1) | (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((~ (member @ Y2 @ Y1 @ X1)) | (~ (member @ Y2 @ Y0 @ X1)))))))) | (~ ((~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ X1) => ((~ (member @ Y2 @ Y1 @ X1)) | (~ (member @ Y2 @ Y0 @ X1))))))) | (~ (intersect @ Y0 @ Y1 @ X1)))))))))))) = $true)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f187])).
% 0.23/0.44 thf(f187,plain,(
% 0.23/0.44 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((intersect @ Y1 @ Y2 @ Y0) | (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0)))))))) | (~ ((~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0))))))) | (~ (intersect @ Y1 @ Y2 @ Y0))))))))))))) @ X1) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f186])).
% 0.23/0.44 thf(f186,plain,(
% 0.23/0.44 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((intersect @ Y1 @ Y2 @ Y0) | (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0)))))))) | (~ ((~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0))))))) | (~ (intersect @ Y1 @ Y2 @ Y0)))))))))))))) = $true)),
% 0.23/0.44 inference(boolean_simplification,[],[f185])).
% 0.23/0.44 thf(f185,plain,(
% 0.23/0.44 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((intersect @ Y1 @ Y2 @ Y0) | (~ (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0)))))))))) | (~ ((~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0))))))) | (~ (intersect @ Y1 @ Y2 @ Y0)))))))))))))) = $true)),
% 0.23/0.44 inference(boolean_simplification,[],[f184])).
% 0.23/0.44 thf(f184,plain,(
% 0.23/0.44 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((intersect @ Y1 @ Y2 @ Y0) | (~ (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => (~ (~ ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0)))))))))))) | (~ ((~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => (~ (~ ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0))))))))) | (~ (intersect @ Y1 @ Y2 @ Y0)))))))))))))) = $true)),
% 0.23/0.44 inference(beta_eta_normalization,[],[f179])).
% 0.23/0.44 thf(f179,plain,(
% 0.23/0.44 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y5)))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y2 @ Y3) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y3 @ Y2))))) @ (intersect @ Y0 @ Y1) @ ((^[Y2 : mu > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ ((^[Y3 : mu > $i > $o]: ((^[Y4 : $i]: (!! @ mu @ (^[Y5 : mu]: ((exists_in_world @ Y5 @ Y4) => (Y3 @ Y5 @ Y4))))))) @ (^[Y3 : mu]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ (Y2 @ Y3)))))) @ (^[Y2 : mu]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: ((Y6 @ Y7) | (Y5 @ Y7))))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y3) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y4)))))) @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.23/0.44 inference(definition_unfolding,[],[f148,f129,f144,f144,f169,f172,f166])).
% 0.23/0.44 thf(f166,plain,(
% 0.23/0.44 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.23/0.44 inference(definition_unfolding,[],[f161,f127,f162,f127,f127])).
% 0.23/0.44 thf(f162,plain,(
% 0.23/0.44 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f104])).
% 0.23/0.44 thf(f104,plain,(
% 0.23/0.44 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.23/0.44 inference(fool_elimination,[],[f103])).
% 0.23/0.44 thf(f103,plain,(
% 0.23/0.44 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.23/0.44 inference(rectify,[],[f3])).
% 0.23/0.44 thf(f3,axiom,(
% 0.23/0.44 (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.23/0.44 thf(f127,plain,(
% 0.23/0.44 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f56])).
% 0.23/0.44 thf(f56,plain,(
% 0.23/0.44 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.23/0.44 inference(fool_elimination,[],[f55])).
% 0.23/0.44 thf(f55,plain,(
% 0.23/0.44 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.23/0.44 inference(rectify,[],[f2])).
% 0.23/0.44 thf(f2,axiom,(
% 0.23/0.44 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.23/0.44 thf(f161,plain,(
% 0.23/0.44 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f70])).
% 0.23/0.44 thf(f70,plain,(
% 0.23/0.44 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.23/0.44 inference(fool_elimination,[],[f69])).
% 0.23/0.44 thf(f69,plain,(
% 0.23/0.44 (mand = (^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))))),
% 0.23/0.44 inference(rectify,[],[f8])).
% 0.23/0.44 thf(f8,axiom,(
% 0.23/0.44 (mand = (^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 0.23/0.44 thf(f172,plain,(
% 0.23/0.44 (mexists_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))))),
% 0.23/0.44 inference(definition_unfolding,[],[f137,f127,f144,f127])).
% 0.23/0.44 thf(f137,plain,(
% 0.23/0.44 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f46])).
% 0.23/0.44 thf(f46,plain,(
% 0.23/0.44 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.23/0.44 inference(fool_elimination,[],[f45])).
% 0.23/0.44 thf(f45,plain,(
% 0.23/0.44 (mexists_ind = (^[X0 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X1 : mu] : (mnot @ (X0 @ X1)))))))),
% 0.23/0.44 inference(rectify,[],[f16])).
% 0.23/0.44 thf(f16,axiom,(
% 0.23/0.44 (mexists_ind = (^[X3 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X0 : mu] : (mnot @ (X3 @ X0)))))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_ind)).
% 0.23/0.44 thf(f169,plain,(
% 0.23/0.44 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y3)))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y1 @ Y0))))))),
% 0.23/0.44 inference(definition_unfolding,[],[f153,f166,f167,f167])).
% 0.23/0.44 thf(f167,plain,(
% 0.23/0.44 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.23/0.44 inference(definition_unfolding,[],[f159,f162,f127])).
% 0.23/0.44 thf(f159,plain,(
% 0.23/0.44 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.23/0.44 inference(cnf_transformation,[],[f80])).
% 0.23/0.44 thf(f80,plain,(
% 0.23/0.44 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.23/0.44 inference(fool_elimination,[],[f79])).
% 0.23/0.44 thf(f79,plain,(
% 0.23/0.44 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.23/0.44 inference(rectify,[],[f9])).
% 0.23/0.44 thf(f9,axiom,(
% 0.23/0.44 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.23/0.44 thf(f153,plain,(
% 0.23/0.44 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f78])).
% 0.23/0.44 thf(f78,plain,(
% 0.23/0.44 (mequiv = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mand @ (mimplies @ Y0 @ Y1) @ (mimplies @ Y1 @ Y0))))))),
% 0.23/0.44 inference(fool_elimination,[],[f77])).
% 0.23/0.44 thf(f77,plain,(
% 0.23/0.44 (mequiv = (^[X0 : $i > $o, X1 : $i > $o] : (mand @ (mimplies @ X0 @ X1) @ (mimplies @ X1 @ X0))))),
% 0.23/0.44 inference(rectify,[],[f11])).
% 0.23/0.44 thf(f11,axiom,(
% 0.23/0.44 (mequiv = (^[X3 : $i > $o, X4 : $i > $o] : (mand @ (mimplies @ X3 @ X4) @ (mimplies @ X4 @ X3))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mequiv)).
% 0.23/0.44 thf(f144,plain,(
% 0.23/0.44 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.23/0.44 inference(cnf_transformation,[],[f108])).
% 0.23/0.44 thf(f108,plain,(
% 0.23/0.44 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.23/0.44 inference(fool_elimination,[],[f107])).
% 0.23/0.44 thf(f107,plain,(
% 0.23/0.44 ((^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : ((exists_in_world @ X2 @ X1) => (X0 @ X2 @ X1)))) = mforall_ind)),
% 0.23/0.44 inference(rectify,[],[f15])).
% 0.23/0.44 thf(f15,axiom,(
% 0.23/0.44 ((^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : ((exists_in_world @ X0 @ X2) => (X3 @ X0 @ X2)))) = mforall_ind)),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind)).
% 0.23/0.44 thf(f129,plain,(
% 0.23/0.44 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.23/0.44 inference(cnf_transformation,[],[f44])).
% 0.23/0.44 thf(f44,plain,(
% 0.23/0.44 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.23/0.44 inference(fool_elimination,[],[f43])).
% 0.23/0.44 thf(f43,plain,(
% 0.23/0.44 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.23/0.44 inference(rectify,[],[f28])).
% 0.23/0.44 thf(f28,axiom,(
% 0.23/0.44 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.23/0.44 thf(f148,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (intersect @ Y0 @ Y1) @ (mexists_ind @ (^[Y2 : mu]: (mand @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.23/0.44 inference(cnf_transformation,[],[f58])).
% 0.23/0.44 thf(f58,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (intersect @ Y0 @ Y1) @ (mexists_ind @ (^[Y2 : mu]: (mand @ (member @ Y2 @ Y0) @ (member @ Y2 @ Y1)))))))))) = $true)),
% 0.23/0.44 inference(fool_elimination,[],[f57])).
% 0.23/0.44 thf(f57,plain,(
% 0.23/0.44 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mequiv @ (intersect @ X0 @ X1) @ (mexists_ind @ (^[X2 : mu] : (mand @ (member @ X2 @ X0) @ (member @ X2 @ X1))))))))))),
% 0.23/0.44 inference(rectify,[],[f37])).
% 0.23/0.44 thf(f37,axiom,(
% 0.23/0.44 (mvalid @ (mforall_ind @ (^[X11 : mu] : (mforall_ind @ (^[X12 : mu] : (mequiv @ (intersect @ X11 @ X12) @ (mexists_ind @ (^[X13 : mu] : (mand @ (member @ X13 @ X11) @ (member @ X13 @ X12))))))))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn)).
% 0.23/0.44 thf(f477,plain,(
% 0.23/0.44 spl1_7 | spl1_6 | spl1_1 | spl1_2),
% 0.23/0.44 inference(avatar_split_clause,[],[f476,f290,f286,f467,f471])).
% 0.23/0.44 thf(f476,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | (spl1_1 | spl1_2)),
% 0.23/0.44 inference(subsumption_resolution,[],[f475,f287])).
% 0.23/0.44 thf(f475,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) = $false) | ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | spl1_2),
% 0.23/0.44 inference(subsumption_resolution,[],[f461,f291])).
% 0.23/0.44 thf(f461,plain,(
% 0.23/0.44 ((exists_in_world @ sK5 @ sK3) = $false) | ((exists_in_world @ sK4 @ sK3) = $false) | ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | spl1_2),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f460])).
% 0.23/0.44 thf(f460,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | ($false = $true) | ((exists_in_world @ sK5 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | ((exists_in_world @ sK4 @ sK3) = $false) | spl1_2),
% 0.23/0.44 inference(duplicate_literal_removal,[],[f458])).
% 0.23/0.44 thf(f458,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false) | ($false = $true) | ((exists_in_world @ sK4 @ sK3) = $false) | ((intersect @ sK4 @ sK5 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ sK4) @ sK3) = $false) | ((exists_in_world @ sK4 @ sK3) = $false) | spl1_2),
% 0.23/0.44 inference(superposition,[],[f329,f217])).
% 0.23/0.44 thf(f217,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ((intersect @ X2 @ X3 @ X1) = $false) | ((exists_in_world @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f214])).
% 0.23/0.44 thf(f214,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1)) = $false) | ((exists_in_world @ X3 @ X1) = $false) | ((intersect @ X2 @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f212])).
% 0.23/0.44 thf(f212,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((intersect @ X2 @ X3 @ X1) = $false) | ((exists_in_world @ X3 @ X1) = $false) | (((~ (member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1)) | (~ (member @ (sK2 @ X3 @ X1 @ X2) @ X2 @ X1))) = $false)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f211])).
% 0.23/0.44 thf(f329,plain,(
% 0.23/0.44 ( ! [X0 : mu] : (((member @ (sK2 @ sK5 @ sK3 @ X0) @ sK4 @ sK3) = $false) | ((exists_in_world @ X0 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ X0) @ sK3) = $false) | ((intersect @ X0 @ sK5 @ sK3) = $false)) ) | spl1_2),
% 0.23/0.44 inference(subsumption_resolution,[],[f328,f291])).
% 0.23/0.44 thf(f328,plain,(
% 0.23/0.44 ( ! [X0 : mu] : (((member @ (sK2 @ sK5 @ sK3 @ X0) @ sK4 @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false) | ((exists_in_world @ X0 @ sK3) = $false) | ((exists_in_world @ (sK2 @ sK5 @ sK3 @ X0) @ sK3) = $false) | ((intersect @ X0 @ sK5 @ sK3) = $false)) )),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f325])).
% 0.23/0.44 thf(f325,plain,(
% 0.23/0.44 ( ! [X0 : mu] : (((exists_in_world @ (sK2 @ sK5 @ sK3 @ X0) @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false) | ((member @ (sK2 @ sK5 @ sK3 @ X0) @ sK4 @ sK3) = $false) | ((intersect @ X0 @ sK5 @ sK3) = $false) | ($false = $true) | ((exists_in_world @ X0 @ sK3) = $false)) )),
% 0.23/0.44 inference(superposition,[],[f216,f237])).
% 0.23/0.44 thf(f237,plain,(
% 0.23/0.44 ( ! [X1 : mu] : (($false = (member @ X1 @ sK5 @ sK3)) | ($false = (exists_in_world @ X1 @ sK3)) | ($false = (member @ X1 @ sK4 @ sK3))) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f236])).
% 0.23/0.44 thf(f236,plain,(
% 0.23/0.44 ( ! [X1 : mu] : (($false = (exists_in_world @ X1 @ sK3)) | ($false = (member @ X1 @ sK4 @ sK3)) | ((~ (member @ X1 @ sK5 @ sK3)) = $true)) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f235])).
% 0.23/0.44 thf(f235,plain,(
% 0.23/0.44 ( ! [X1 : mu] : (((~ (member @ X1 @ sK4 @ sK3)) = $true) | ($false = (exists_in_world @ X1 @ sK3)) | ((~ (member @ X1 @ sK5 @ sK3)) = $true)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f234])).
% 0.23/0.44 thf(f234,plain,(
% 0.23/0.44 ( ! [X1 : mu] : ((((~ (member @ X1 @ sK5 @ sK3)) | (~ (member @ X1 @ sK4 @ sK3))) = $true) | ($false = (exists_in_world @ X1 @ sK3))) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f233])).
% 0.23/0.44 thf(f233,plain,(
% 0.23/0.44 ( ! [X1 : mu] : ((((exists_in_world @ X1 @ sK3) => ((~ (member @ X1 @ sK5 @ sK3)) | (~ (member @ X1 @ sK4 @ sK3)))) = $true)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f232])).
% 0.23/0.44 thf(f232,plain,(
% 0.23/0.44 ( ! [X1 : mu] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((~ (member @ Y0 @ sK5 @ sK3)) | (~ (member @ Y0 @ sK4 @ sK3))))) @ X1) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f231])).
% 0.23/0.44 thf(f231,plain,(
% 0.23/0.44 ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((~ (member @ Y0 @ sK5 @ sK3)) | (~ (member @ Y0 @ sK4 @ sK3)))))) = $true)),
% 0.23/0.44 inference(not_proxy_clausification,[],[f229])).
% 0.23/0.44 thf(f229,plain,(
% 0.23/0.44 ((~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((~ (member @ Y0 @ sK5 @ sK3)) | (~ (member @ Y0 @ sK4 @ sK3))))))) = $false)),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f227])).
% 0.23/0.44 thf(f227,plain,(
% 0.23/0.44 ($false = ((disjoint @ sK4 @ sK5 @ sK3) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((~ (member @ Y0 @ sK5 @ sK3)) | (~ (member @ Y0 @ sK4 @ sK3)))))))))),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f226])).
% 0.23/0.44 thf(f226,plain,(
% 0.23/0.44 (((exists_in_world @ sK5 @ sK3) => ((disjoint @ sK4 @ sK5 @ sK3) | (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((~ (member @ Y0 @ sK5 @ sK3)) | (~ (member @ Y0 @ sK4 @ sK3))))))))) = $false)),
% 0.23/0.44 inference(beta_eta_normalization,[],[f225])).
% 0.23/0.44 thf(f225,plain,(
% 0.23/0.44 (((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((disjoint @ sK4 @ Y0 @ sK3) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK3) => ((~ (member @ Y1 @ Y0 @ sK3)) | (~ (member @ Y1 @ sK4 @ sK3)))))))))) @ sK5) = $false)),
% 0.23/0.44 inference(sigma_clausification,[],[f223])).
% 0.23/0.44 thf(f223,plain,(
% 0.23/0.44 ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((disjoint @ sK4 @ Y0 @ sK3) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK3) => ((~ (member @ Y1 @ Y0 @ sK3)) | (~ (member @ Y1 @ sK4 @ sK3))))))))))) = $false)),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f222])).
% 0.23/0.44 thf(f222,plain,(
% 0.23/0.44 (((exists_in_world @ sK4 @ sK3) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => ((disjoint @ sK4 @ Y0 @ sK3) | (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK3) => ((~ (member @ Y1 @ Y0 @ sK3)) | (~ (member @ Y1 @ sK4 @ sK3)))))))))))) = $false)),
% 0.23/0.44 inference(beta_eta_normalization,[],[f221])).
% 0.23/0.44 thf(f221,plain,(
% 0.23/0.44 (((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK3) => ((disjoint @ Y0 @ Y1 @ sK3) | (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ sK3) => ((~ (member @ Y2 @ Y1 @ sK3)) | (~ (member @ Y2 @ Y0 @ sK3))))))))))))) @ sK4) = $false)),
% 0.23/0.44 inference(sigma_clausification,[],[f220])).
% 0.23/0.44 thf(f220,plain,(
% 0.23/0.44 ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ sK3) => ((disjoint @ Y0 @ Y1 @ sK3) | (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ sK3) => ((~ (member @ Y2 @ Y1 @ sK3)) | (~ (member @ Y2 @ Y0 @ sK3)))))))))))))) = $false)),
% 0.23/0.44 inference(beta_eta_normalization,[],[f219])).
% 0.23/0.44 thf(f219,plain,(
% 0.23/0.44 (((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => ((disjoint @ Y1 @ Y2 @ Y0) | (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0))))))))))))))) @ sK3) = $false)),
% 0.23/0.44 inference(sigma_clausification,[],[f218])).
% 0.23/0.44 thf(f218,plain,(
% 0.23/0.44 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => ((disjoint @ Y1 @ Y2 @ Y0) | (~ (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y0) => ((~ (member @ Y3 @ Y2 @ Y0)) | (~ (member @ Y3 @ Y1 @ Y0)))))))))))))))))),
% 0.23/0.44 inference(beta_eta_normalization,[],[f178])).
% 0.23/0.44 thf(f178,plain,(
% 0.23/0.44 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ ((^[Y2 : mu > $i > $o]: ((^[Y3 : $i]: (!! @ mu @ (^[Y4 : mu]: ((exists_in_world @ Y4 @ Y3) => (Y2 @ Y4 @ Y3))))))) @ (^[Y2 : mu]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: ((Y6 @ Y7) | (Y5 @ Y7))))))) @ ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (~ (Y5 @ Y6))))) @ Y3) @ Y4)))) @ (member @ Y2 @ Y0) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ (member @ Y2 @ Y1))))) @ (disjoint @ Y0 @ Y1))))))) != $true)),
% 0.23/0.44 inference(definition_unfolding,[],[f146,f129,f144,f144,f167,f144,f167,f127])).
% 0.23/0.44 thf(f146,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mimplies @ (mforall_ind @ (^[Y2 : mu]: (mimplies @ (member @ Y2 @ Y0) @ (mnot @ (member @ Y2 @ Y1))))) @ (disjoint @ Y0 @ Y1))))))) != $true)),
% 0.23/0.44 inference(cnf_transformation,[],[f120])).
% 0.23/0.44 thf(f120,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mimplies @ (mforall_ind @ (^[Y2 : mu]: (mimplies @ (member @ Y2 @ Y0) @ (mnot @ (member @ Y2 @ Y1))))) @ (disjoint @ Y0 @ Y1))))))) != $true)),
% 0.23/0.44 inference(flattening,[],[f102])).
% 0.23/0.44 thf(f102,plain,(
% 0.23/0.44 ~((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mimplies @ (mforall_ind @ (^[Y2 : mu]: (mimplies @ (member @ Y2 @ Y0) @ (mnot @ (member @ Y2 @ Y1))))) @ (disjoint @ Y0 @ Y1))))))) = $true)),
% 0.23/0.44 inference(fool_elimination,[],[f101])).
% 0.23/0.44 thf(f101,plain,(
% 0.23/0.44 ~(mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mimplies @ (mforall_ind @ (^[X2 : mu] : (mimplies @ (member @ X2 @ X0) @ (mnot @ (member @ X2 @ X1))))) @ (disjoint @ X0 @ X1)))))))),
% 0.23/0.44 inference(rectify,[],[f41])).
% 0.23/0.44 thf(f41,negated_conjecture,(
% 0.23/0.44 ~(mvalid @ (mforall_ind @ (^[X11 : mu] : (mforall_ind @ (^[X12 : mu] : (mimplies @ (mforall_ind @ (^[X13 : mu] : (mimplies @ (member @ X13 @ X11) @ (mnot @ (member @ X13 @ X12))))) @ (disjoint @ X11 @ X12)))))))),
% 0.23/0.44 inference(negated_conjecture,[],[f40])).
% 0.23/0.44 thf(f40,conjecture,(
% 0.23/0.44 (mvalid @ (mforall_ind @ (^[X11 : mu] : (mforall_ind @ (^[X12 : mu] : (mimplies @ (mforall_ind @ (^[X13 : mu] : (mimplies @ (member @ X13 @ X11) @ (mnot @ (member @ X13 @ X12))))) @ (disjoint @ X11 @ X12)))))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th17)).
% 0.23/0.44 thf(f216,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1) = $true) | ($false = (exists_in_world @ X2 @ X1)) | ((intersect @ X2 @ X3 @ X1) = $false) | ((exists_in_world @ X3 @ X1) = $false)) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f215])).
% 0.23/0.44 thf(f215,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ((intersect @ X2 @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1)) | ((~ (member @ (sK2 @ X3 @ X1 @ X2) @ X3 @ X1)) = $false)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f212])).
% 0.23/0.44 thf(f433,plain,(
% 0.23/0.44 ~spl1_1),
% 0.23/0.44 inference(avatar_contradiction_clause,[],[f432])).
% 0.23/0.44 thf(f432,plain,(
% 0.23/0.44 $false | ~spl1_1),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f426])).
% 0.23/0.44 thf(f426,plain,(
% 0.23/0.44 ($false = $true) | ~spl1_1),
% 0.23/0.44 inference(superposition,[],[f224,f288])).
% 0.23/0.44 thf(f288,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) = $false) | ~spl1_1),
% 0.23/0.44 inference(avatar_component_clause,[],[f286])).
% 0.23/0.44 thf(f224,plain,(
% 0.23/0.44 ((exists_in_world @ sK4 @ sK3) = $true)),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f222])).
% 0.23/0.44 thf(f308,plain,(
% 0.23/0.44 ~spl1_2),
% 0.23/0.44 inference(avatar_contradiction_clause,[],[f307])).
% 0.23/0.44 thf(f307,plain,(
% 0.23/0.44 $false | ~spl1_2),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f299])).
% 0.23/0.44 thf(f299,plain,(
% 0.23/0.44 ($false = $true) | ~spl1_2),
% 0.23/0.44 inference(superposition,[],[f292,f228])).
% 0.23/0.44 thf(f228,plain,(
% 0.23/0.44 ((exists_in_world @ sK5 @ sK3) = $true)),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f226])).
% 0.23/0.44 thf(f292,plain,(
% 0.23/0.44 ((exists_in_world @ sK5 @ sK3) = $false) | ~spl1_2),
% 0.23/0.44 inference(avatar_component_clause,[],[f290])).
% 0.23/0.44 thf(f298,plain,(
% 0.23/0.44 spl1_1 | spl1_2 | spl1_3),
% 0.23/0.44 inference(avatar_split_clause,[],[f283,f294,f290,f286])).
% 0.23/0.44 thf(f283,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $true) | ((exists_in_world @ sK4 @ sK3) = $false) | ((exists_in_world @ sK5 @ sK3) = $false)),
% 0.23/0.44 inference(trivial_inequality_removal,[],[f281])).
% 0.23/0.44 thf(f281,plain,(
% 0.23/0.44 ((intersect @ sK4 @ sK5 @ sK3) = $true) | ((exists_in_world @ sK5 @ sK3) = $false) | ($false = $true) | ((exists_in_world @ sK4 @ sK3) = $false)),
% 0.23/0.44 inference(superposition,[],[f272,f230])).
% 0.23/0.44 thf(f230,plain,(
% 0.23/0.44 ((disjoint @ sK4 @ sK5 @ sK3) = $false)),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f227])).
% 0.23/0.44 thf(f272,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((disjoint @ X2 @ X3 @ X1) = $true) | ((intersect @ X2 @ X3 @ X1) = $true) | ((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f271])).
% 0.23/0.44 thf(f271,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($true = ((disjoint @ X2 @ X3 @ X1) | (intersect @ X2 @ X3 @ X1))) | ((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f270])).
% 0.23/0.44 thf(f270,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1)) | ((~ ((disjoint @ X2 @ X3 @ X1) | (intersect @ X2 @ X3 @ X1))) = $false)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f268])).
% 0.23/0.44 thf(f268,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = ((~ ((disjoint @ X2 @ X3 @ X1) | (intersect @ X2 @ X3 @ X1))) | (~ ((~ (intersect @ X2 @ X3 @ X1)) | (~ (disjoint @ X2 @ X3 @ X1)))))) | ((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(not_proxy_clausification,[],[f267])).
% 0.23/0.44 thf(f267,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (((exists_in_world @ X3 @ X1) = $false) | ($false = (exists_in_world @ X2 @ X1)) | ((~ ((~ ((disjoint @ X2 @ X3 @ X1) | (intersect @ X2 @ X3 @ X1))) | (~ ((~ (intersect @ X2 @ X3 @ X1)) | (~ (disjoint @ X2 @ X3 @ X1)))))) = $true)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f266])).
% 0.23/0.44 thf(f266,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : ((((exists_in_world @ X3 @ X1) => (~ ((~ ((disjoint @ X2 @ X3 @ X1) | (intersect @ X2 @ X3 @ X1))) | (~ ((~ (intersect @ X2 @ X3 @ X1)) | (~ (disjoint @ X2 @ X3 @ X1))))))) = $true) | ($false = (exists_in_world @ X2 @ X1))) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f265])).
% 0.23/0.44 thf(f265,plain,(
% 0.23/0.44 ( ! [X2 : mu,X3 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | (((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((disjoint @ X2 @ Y0 @ X1) | (intersect @ X2 @ Y0 @ X1))) | (~ ((~ (intersect @ X2 @ Y0 @ X1)) | (~ (disjoint @ X2 @ Y0 @ X1)))))))) @ X3) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f264])).
% 0.23/0.44 thf(f264,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : (($false = (exists_in_world @ X2 @ X1)) | ((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((disjoint @ X2 @ Y0 @ X1) | (intersect @ X2 @ Y0 @ X1))) | (~ ((~ (intersect @ X2 @ Y0 @ X1)) | (~ (disjoint @ X2 @ Y0 @ X1))))))))) = $true)) )),
% 0.23/0.44 inference(binary_proxy_clausification,[],[f263])).
% 0.23/0.44 thf(f263,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : ((((exists_in_world @ X2 @ X1) => (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (~ ((~ ((disjoint @ X2 @ Y0 @ X1) | (intersect @ X2 @ Y0 @ X1))) | (~ ((~ (intersect @ X2 @ Y0 @ X1)) | (~ (disjoint @ X2 @ Y0 @ X1)))))))))) = $true)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f262])).
% 0.23/0.44 thf(f262,plain,(
% 0.23/0.44 ( ! [X2 : mu,X1 : $i] : ((((^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((disjoint @ Y0 @ Y1 @ X1) | (intersect @ Y0 @ Y1 @ X1))) | (~ ((~ (intersect @ Y0 @ Y1 @ X1)) | (~ (disjoint @ Y0 @ Y1 @ X1))))))))))) @ X2) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f261])).
% 0.23/0.44 thf(f261,plain,(
% 0.23/0.44 ( ! [X1 : $i] : (((!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X1) => (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ X1) => (~ ((~ ((disjoint @ Y0 @ Y1 @ X1) | (intersect @ Y0 @ Y1 @ X1))) | (~ ((~ (intersect @ Y0 @ Y1 @ X1)) | (~ (disjoint @ Y0 @ Y1 @ X1)))))))))))) = $true)) )),
% 0.23/0.44 inference(beta_eta_normalization,[],[f260])).
% 0.23/0.44 thf(f260,plain,(
% 0.23/0.44 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((disjoint @ Y1 @ Y2 @ Y0) | (intersect @ Y1 @ Y2 @ Y0))) | (~ ((~ (intersect @ Y1 @ Y2 @ Y0)) | (~ (disjoint @ Y1 @ Y2 @ Y0))))))))))))) @ X1) = $true)) )),
% 0.23/0.44 inference(pi_clausification,[],[f259])).
% 0.23/0.44 thf(f259,plain,(
% 0.23/0.44 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((disjoint @ Y1 @ Y2 @ Y0) | (intersect @ Y1 @ Y2 @ Y0))) | (~ ((~ (intersect @ Y1 @ Y2 @ Y0)) | (~ (disjoint @ Y1 @ Y2 @ Y0)))))))))))))))),
% 0.23/0.44 inference(boolean_simplification,[],[f258])).
% 0.23/0.44 thf(f258,plain,(
% 0.23/0.44 ((!! @ $i @ (^[Y0 : $i]: (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y0) => (~ ((~ ((disjoint @ Y1 @ Y2 @ Y0) | (~ (~ (intersect @ Y1 @ Y2 @ Y0))))) | (~ ((~ (intersect @ Y1 @ Y2 @ Y0)) | (~ (disjoint @ Y1 @ Y2 @ Y0)))))))))))))) = $true)),
% 0.23/0.44 inference(beta_eta_normalization,[],[f175])).
% 0.23/0.44 thf(f175,plain,(
% 0.23/0.44 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))) @ (^[Y0 : mu]: ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y5)))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y2 @ Y3) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i > $o]: ((^[Y7 : $i > $o]: ((^[Y8 : $i]: ((Y7 @ Y8) | (Y6 @ Y8))))))) @ ((^[Y6 : $i > $o]: ((^[Y7 : $i]: (~ (Y6 @ Y7))))) @ Y4) @ Y5)))) @ Y3 @ Y2))))) @ (disjoint @ Y0 @ Y1) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (intersect @ Y0 @ Y1)))))))) = $true)),
% 0.23/0.44 inference(definition_unfolding,[],[f125,f129,f144,f144,f169,f127])).
% 0.23/0.44 thf(f125,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (disjoint @ Y0 @ Y1) @ (mnot @ (intersect @ Y0 @ Y1)))))))) = $true)),
% 0.23/0.44 inference(cnf_transformation,[],[f84])).
% 0.23/0.44 thf(f84,plain,(
% 0.23/0.44 ((mvalid @ (mforall_ind @ (^[Y0 : mu]: (mforall_ind @ (^[Y1 : mu]: (mequiv @ (disjoint @ Y0 @ Y1) @ (mnot @ (intersect @ Y0 @ Y1)))))))) = $true)),
% 0.23/0.44 inference(fool_elimination,[],[f83])).
% 0.23/0.44 thf(f83,plain,(
% 0.23/0.44 (mvalid @ (mforall_ind @ (^[X0 : mu] : (mforall_ind @ (^[X1 : mu] : (mequiv @ (disjoint @ X0 @ X1) @ (mnot @ (intersect @ X0 @ X1))))))))),
% 0.23/0.44 inference(rectify,[],[f38])).
% 0.23/0.44 thf(f38,axiom,(
% 0.23/0.44 (mvalid @ (mforall_ind @ (^[X11 : mu] : (mforall_ind @ (^[X12 : mu] : (mequiv @ (disjoint @ X11 @ X12) @ (mnot @ (intersect @ X11 @ X12))))))))),
% 0.23/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn)).
% 0.23/0.44 % SZS output end Proof for theBenchmark
% 0.23/0.44 % (3680)------------------------------
% 0.23/0.44 % (3680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (3680)Termination reason: Refutation
% 0.23/0.44
% 0.23/0.44 % (3680)Memory used [KB]: 6140
% 0.23/0.44 % (3680)Time elapsed: 0.041 s
% 0.23/0.44 % (3680)Instructions burned: 61 (million)
% 0.23/0.44 % (3680)------------------------------
% 0.23/0.44 % (3680)------------------------------
% 0.23/0.44 % (3679)Success in time 0.041 s
% 0.23/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------